Strategy-proof popular mechanisms

We consider the allocation of indivisible objects when agents have preferences over their own allocations, but share ownership resources to be distributed. Examples might include seats in public schools, faculty offices, and time slots tennis courts. Given an allocation, groups who would prefer alternative challenge it. An assignment is popular if it not challenged by another one. By assuming that agents’ ability allocations can represented weighted votes, we characterize conditions under which exist these implemented via strategy-proof mechanisms. Serial dictatorships use orderings consistent with weights are only Pareto efficient, also popular, whenever assignments exist. provide a new characterization for serial as mechanisms strategy-proof, non-wasteful, satisfy consistency condition.